Non-backtracking cycles: length spectrum theory and graph mining applications
نویسندگان
چکیده
منابع مشابه
The Non-backtracking Spectrum of the Universal Cover of a Graph
A non-backtracking walk on a graph, H , is a directed path of directed edges of H such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given length can be counted using the non-backtracking adjacency matrix, B, indexed by H ’s directed edges and related to Ihara’s Zeta function. We show how to determine B’s spectrum in the case where H is a tree covering a finite ...
متن کاملNon-Backtracking Spectrum of Degree-Corrected Stochastic Block Models
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on n vertices partitioned into two equalsized clusters. The vertices have i.i.d. weights {φu}u=1 with second moment Φ. The intra-cluster connection probability for vertices u and v is φuφv n a and the inter-clust...
متن کاملOn Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation
Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding (NOBE), which offers a new perspective that organizes graph data at a deep level by tracking the flow traversing on the edges with backtracking prohibited. Further, by analyzing the non-backtracking process, a techni...
متن کاملCycles in Non-mining Business Investment
Bulletin | D E C E M B E R Q ua R t E R 2014 Growth in private non-mining business investment has been quite subdued over the past few years relative to the cyclical upswings seen in the 1980s and 1990s. Part of this weakness can be explained by cyclical factors that affect investment – such as a more moderate pace of growth in the output of, and demand for, non-mining goods and services. Furth...
متن کاملMaximum packings of the complete graph with uniform length cycles
In this paper we find the maximum number of pairwise edge-disjoint mcycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Network Science
سال: 2019
ISSN: 2364-8228
DOI: 10.1007/s41109-019-0147-y